Dependent Shrink of Transitions for Calculating Firing Frequencies in Signaling Pathway Petri Net Model
نویسندگان
چکیده
Despite the recent rapid progress in high throughput measurements of biological data, it is still difficult to gather all of the reaction speed data in biological pathways. This paper presents a Petri net-based algorithm that can derive estimated values for non-valid reaction speeds in a signaling pathway from biologically-valid data. In fact, these reaction speeds are reflected based on the delay times in the timed Petri net model of the signaling pathway. We introduce the concept of a “dependency relation” over a transition set of a Petri net and derive the properties of the dependency relation through a structural analysis. Based on the theoretical results, the proposed algorithm can efficiently shrink the transitions with two elementary structures into a single transition repeatedly to reduce the Petri net size in order to eventually discover all transition sets with a dependency relation. Finally, to show the usefulness of our algorithm, we apply our algorithm to the IL-3 Petri net model.
منابع مشابه
Dependent shrink for Petri net models of signaling pathways
Retention-free Petri net has been used in modeling of signaling pathways, which is a timed Petri net such that total input and total output token flows are equivalent at any place. Previously we have investigated the dependency of transitions in retention-free Petri net. In this paper, we introduce a modeling method for signaling pathway by using Petri net, giving properties of retention-freene...
متن کاملA Novel Continuous Model to Approximate Time Petri Nets: Modelling and Analysis
In order to approximate discrete-event systems in which there exist considerable states and events, David and Alla define a continuous Petri net (CPN). So far, CPNs have been a useful tool not only for approximating discrete-event systems but also for modelling continuous processes. Due to different ways of calculating instantaneous firing speeds of transitions, various continuous Petri net mod...
متن کاملNew Developments in Closed-Form Computation for GSPN Aggregation
Petri nets are useful for modelling complex concurrent systems. While modelling using Petri nets focusses on local states and actions, the analysis methods are concerned with global states and their transitions. Unfortunately generation of the complete state space suffers from the well-known state space explosion problem. This paper presents a method to overcome the state-space explosion proble...
متن کاملMuPSi - a multitouch Petri net simulator for transition steps
Petri nets are very useful for modeling systems with concurrent behavior. There are many editors which support the creation of a Petri net and almost all editors offer the possibility of simulation, i.e. firing of transitions. Due to the limitation to possible user interaction using a conventional user interface having only one focus a concurrent firing of several transitions is not supported. ...
متن کاملTime and Concurrency - Three Approaches for Intertwining Time and Petri Nets
Time and Petri nets-do they not contradict each other? While time determines the occurrences of events in a system, classic Petri nets consider their causal relationships and represent events as a concurrent system. At first, these two appear to be at odds with each other, but taking a closer look at how time and causality are intertwined, one realizes that time actually enriches Petri nets. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Algorithms
دوره 10 شماره
صفحات -
تاریخ انتشار 2017